Computability on dI-Domains

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semilattices, Domains, and Computability (Invited Talk)

As everyone knows, one popular notion of Scott domain is defined as a bounded complete algebraic cpo. These are closely related to algebraic lattices: (i) A Scott domain becomes an algebraic lattice with the adjunction of an (isolated) top element. (ii) Every non-empty Scott-closed subset of an algebraic lattice is a Scott domain. Moreover, the isolated (= compact) elements of an algebraic latt...

متن کامل

On Computability

concepts that cut across different areas of mathematics. Logical formality per se does not facilitate the finding of arguments from given assumptions to a particular conclusion. However, strategic considerations can be formulated (for natural deduction calculi) and help to bridge the gap between assumptions and conclusion, suggesting at least a very rough structure of arguments. These logical s...

متن کامل

Gödel on Turing on Computability

In section 9 of his paper, “On Computable Numbers,” Alan Turing outlined an argument for his version of what is now known as the Church–Turing thesis: “the [Turing machine] ‘computable’ numbers include all numbers which would naturally be regarded as computable” [p. 135]. The argument, which relies on an analysis of calculation by an (ideal) human, has attracted much attention in recent years. ...

متن کامل

On computability and disintegration

We show that the disintegration operator on a complete separable metric space along a projection map, restricted to measures for which there is a unique continuous disintegration, is strongly Weihrauch equivalent to the limit operator Lim. When a measure does not have a unique continuous disintegration, we may still obtain a disintegration when some basis of continuity sets has the Vitali cover...

متن کامل

Gödel on computability * Wilfried

The identification of an informal concept of “effective calculability”with a rigorous mathematical notion like “recursiveness” or “Turingcomputability” is still viewed as problematic, and I think rightly so. I analyzethree different and conflicting perspectives Gödel articulated in the three decadesfrom 1934 to 1964. The significant shifts in Gödel's position underline thedi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 1996

ISSN: 0890-5401

DOI: 10.1006/inco.1996.0002